A unifying survey on weighted logics and weighted automata
نویسندگان
چکیده
منابع مشابه
A Unifying Survey on Weighted Logics and Weighted Automata
Logical formalisms equivalent to weighted automata have been the topic of numerous research papers in the recent years. It started with the seminal result by Droste and Gastin on weighted logics over semirings for words. It has been extended in two dimensions by many authors. First, the weight domain has been extended to valuation monoids, valuation structures, etc., to capture more quantitativ...
متن کاملA unifying survey on weighted logics and weighted automata - Core weighted logic: minimal and versatile specification of quantitative properties
Logical formalisms equivalent to weighted automata have been the topic of numerous research papers in the recent years. It started with the seminal result by Droste and Gastin on weighted logics over semirings for words. It has been extended in two dimensions by many authors. First, the weight domain has been extended to valuation monoids, valuation structures, etc., to capture more quantitativ...
متن کاملWeighted Automata and Weighted Logics
In automata theory, Büchi’s and Elgot’s fundamental theorems [6, 7, 25] established the coincidence of regular and ω-regular languages with languages definable in monadic second-order logic. At the same time, Schützenberger [57] investigated finite automata with weights and characterized their behaviours as rational formal power series. Both of these results have inspired a wealth of extensions...
متن کاملA Pebble Weighted Automata and Weighted Logics
We introduce new classes of weighted automata on words. Equipped with pebbles, they go beyond the class of recognizable formal power series: they capture weighted first-order logic enriched with a quantitative version of transitive closure. In contrast to previous work, this calculus allows for unrestricted use of existential and universal quantifications over positions of the input word. We ac...
متن کاملWeighted Automata and Weighted Logics with Discounting
We introduce a weighted logic with discounting and we establish Büchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. Then we investigate Büchi and Muller automata with discounting over the max-plus and the min-plus semiring. We show their expressive equivalence with weighted MSO-sentences with discounting. In this case our logic has a purely s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2015
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-015-1952-6